C:/Users/Mohammad/Dropbox/BSC Error Exponent/BSC_Final Version_July16.dvi
نویسندگان
چکیده
This paper considers the problem of variable-length coding over a binary-input channel with noiseless feedback. A deterministic sequential coding scheme is proposed and shown to attain the optimal error exponent for any binary-input channel whose capacity is achieved by the uniform input distribution. The proposed scheme is deterministic and has only one phase of operation, in contrast to all previous coding schemes that achieve the optimal error exponent.
منابع مشابه
On zero-rate error exponent for BSC with noisy feedback
1 For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback channel. The transmission of a nonexponential number of messages (i.e. the transmission rate equals zero) is considered. The achievable decoding error ex...
متن کاملOn Reliability Function of Gaussian Channel with Noisy Feedback: Zero Transmission Rate
For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also feedback channel with independent additive Gaussian noise, and the transmitter observes without delay all outputs of the forward channel via that feedback channel. Transmission of nonexponential number of messages is considered and the achievable decoding error exponent for such ...
متن کاملRandom codes: Minimum distances and error exponents
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon’s random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length and rate is shown to have minimum distance (2 ), where ( ) is the Gilbert–Varshamov (GV) relative distance at rate , whereas a typical linear co...
متن کاملC:/Users/blwys/Dropbox/Infocom 12/Infocom 12.dvi
Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing proc...
متن کاملOn the zero-rate error exponent for a BSC with noisy feedback
For information transmission, a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes (without delay) all outputs of the forward channel via the feedback channel. Transmission of nonexponentially many messages is considered (i.e., the transmission rate is zero). The achievable decoding error exponent for this comb...
متن کامل